R tree - PDFSEARCH.IO - Document Search Engine

R tree
Results: 1314

#	Item
201	28 CHAPTER 14. APPROXIMATE TREE PATTERN MATCHING Zhang, K., R. Statman and D. Shasha [1992]. \On the editing distance between unordered Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2006-04-04 16:44:52 Knowledge representation Tree Approximate string matching Pruning Systems science Dynamic programming Control theory Systems theory
202	Distributed Computing FS 2013 Prof. R. Wattenhofer / Stephan Holzer Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Combinatorics Graph coloring Chord Tango tree Graph theory Mathematics Distributed data storage
203	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 On the d-Runaway Rectangle Escape Problem Aniket Basu Roy∗, Sathish Govindarajan∗, Neeldhara Misra∗, Shreyas Shetty∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-21 03:29:30 Logic Quadrilaterals Rectangle Bin Algorithm Special case R-tree Hilbert R-tree Packing problem Mathematical logic Geometry Mathematics
204	Transactions of the Important Tree Scientists 120(2): Copyright by the Important Tree Scientists 2002 DETECTION OF LARGE WOODY DEBRIS ACCUMULATIONS IN OLD-GROWTH FORESTS USING SONIC WAVE COLLECTION INDIANA R. JON Add to Reading List Source URL: ontariotrees.com Language: English - Date: 2006-10-28 13:23:09 Environment Debris Large woody debris Coarse woody debris Chequamegon-Nicolet National Forest Old-growth forest If a tree falls in a forest Decibel Mispronunciation Wisconsin Systems ecology Forest ecology
205	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics∗ S¨oren Laue† Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:19 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Facility location Theoretical computer science Computational complexity theory Applied mathematics
206	CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Computing R-tree Segment tree K-d tree Measure B-tree Interval tree Fractional cascading Graph theory Binary trees Data management
207	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Mathematics Distributed computing Top tree Minimum spanning tree Spanning tree Graph theory Theoretical computer science
208	Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-06-22 19:48:39 NP-complete problems Vertex cover Tree decomposition Graph Voltage graph Dominating set Graph theory Theoretical computer science Mathematics
209	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science
210	The R-tree: An Efficient and Robust AccessMethod for Points and Rectangles+ Norbert Beckmann, Hans-Peterbegel Ralf Schneider,Bernhard Seeger Praktuche Informatlk, Umversltaet Bremen, D-2800 Bremen 33, West Germany Add to Reading List Source URL: epub.ub.uni-muenchen.de Language: English* - Date: 2012-05-22 05:07:04 Computer programming R* tree Bin B+ tree Spatial database B-tree Minimum bounding rectangle Algorithm T-tree R-tree Data management Computing

UPDATE